Chromatic Factorisations
نویسندگان
چکیده
The chromatic polynomial gives the number of proper λ-colourings of a graph G. This paper considers factorisation of the chromatic polynomial as a first step in an algebraic study of the roots of this polynomial. The chromatic polynomial of a graph is said to have a chromatic factorisation if P (G, λ) = P (H1, λ)P (H2, λ)/P (Kr, λ) for some graphs H1 and H2 and clique Kr. It is known that the chromatic polynomial of any clique-separable graph, that is, a graph containing a separating r-clique, has a chromatic factorisation. We show that there exist other chromatic polynomials that have chromatic factorisations but are not the chromatic polynomial of any clique-separable graph and identify all such chromatic polynomials of degree at most 10. We introduce the notion of a certificate of factorisation, which provides an explanation for such a factorisation, and find certificates for all cases of degree ≤ 9. The lengths of these certificates are less than an upper bound we establish of ≤ n22n2/2. Furthermore, we construct an infinite family of non-clique-separable graphs that have chromatic factorisations and give certificates of factorisation for graphs belonging to this family.
منابع مشابه
Certificates of Factorisation for Chromatic Polynomials
The chromatic polynomial gives the number of proper λ-colourings of a graph G. This paper considers factorisation of the chromatic polynomial as a first step in an algebraic study of the roots of this polynomial. The chromatic polynomial of a graph is said to have a chromatic factorisation if P (G,λ) = P (H1, λ)P (H2, λ)/P (Kr , λ) for some graphs H1 and H2 and clique Kr. It is known that the c...
متن کاملCertificates of Factorisation for a Class of Triangle-Free Graphs
The chromatic polynomial P (G,λ) gives the number of λ-colourings of a graph. If P (G,λ) = P (H1, λ)P (H2, λ)/P (Kr , λ), then the graph G is said to have a chromatic factorisation with chromatic factors H1 and H2. It is known that the chromatic polynomial of any clique-separable graph has a chromatic factorisation. In this paper we construct an infinite family of graphs that have chromatic fac...
متن کاملCertificates for Properties of Stability Polynomials of Graphs
A stable (or independent) set is a set of vertices where no two of the vertices in the set are adjacent. The stability polynomial A(G; p) of a graph G is the probability that a set of randomly chosen vertices is stable where the probability of each vertex being chosen is p, with choices independent. This polynomial is analogous to the chromatic polynomial in a precise sense. This paper consider...
متن کاملChromatic Factors
The chromatic polynomial P (G, λ) gives the number of proper colourings of a graph G in at most λ colours. If P (G, λ) = P (H1, λ)P (H2, λ) /P (Kr, λ), then G is said to have a chromatic factorisation of order r with chromatic factors H1 and H2. It is clear that, if 0 ≤ r ≤ 2, any H1 6∼= Kr with chromatic number χ(H1) ≥ r is the chromatic factor of some chromatic factorisation of order r. We sh...
متن کاملOn Factorisations of Matrices and Abelian Groups
We establish correspondances between factorisations of finite abelian groups ( direct factors, unitary factors, non isomorphic subgroup classes ) and factorisations of integer matrices. We then study counting functions associated to these factorisations and find average orders. Mathematics Subject Classification 11M41,20K01,15A36.
متن کامل